Banded Householder representation of linear subspaces

نویسنده

  • Geoffrey Irving
چکیده

We show how to compactly represent any n-dimensional subspace of R as a banded product of Householder reflections using n(m − n) floating point numbers. This is optimal since these subspaces form a Grassmannian space Grn(m) of dimension n(m− n). The representation is stable and easy to compute: any matrix can be factored into the product of a banded Householder matrix and a square matrix using two to three QR decompositions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Basis-Kernel Representation of Orthogonal Matrices

In this paper we introduce a new representation of orthogonal matrices. We show that any orthogonal matrix can be represented in the form Q = I ? Y SY T , which we call the basis-kernel representation of Q. We show that the kernel S can be chosen to be triangular and show how the familiar representation of an orthogonal matrix as a product of Householder matrices can be directly derived from a ...

متن کامل

Roundoff Error Analysis of Algorithms Based on Krylov Subspace Methods

We study the roundoff error propagation in an algorithm which computes the orthonormal basis of a Krylov subspace with Householder orthonormal matrices . Moreover, we analyze special implementations of the classical GMRES algorithm, and of the Full Orthogonalization Method . These techniques approximate the solution of a large sparse linear system of equations on a sequence of Krylov subspaces ...

متن کامل

Householder Symposium XVIII on Numerical Linear Algebra

s 6 Awad H. Al-Mohy An Improved Algorithm for the Matrix Logarithm . . . . . . . . . . . . . . . . . . . . 7 David Amsallem Interpolation on Matrix Manifolds of Reduced-Order Models and Application to On-Line Aeroelastic Predictions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Athanasios C. Antoulas Model Reduction of Parameter-Dependent Systems . . . . . . . . . . . . . . . . . . ...

متن کامل

O(n) Algorithms for Banded Plus Semiseparable Matrices

We present a new representation for the inverse of a matrix that is a sum of a banded matrix and a semiseparable matrix. In particular, we show that under certain conditions, the inverse of a banded plus semiseparable matrix can also be expressed as a banded plus semiseparable matrix. Using this result, we devise a fast algorithm for the solution of linear systems of equations involving such ma...

متن کامل

Image Classification via Sparse Representation and Subspace Alignment

Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1108.5822  شماره 

صفحات  -

تاریخ انتشار 2011